Complexity class - PDFSEARCH.IO - Document Search Engine

Complexity class
Results: 67

#	Item
61	2014 Area 4 NCHA Days Circuit Award Winners CLASS: HORSE: RIDER: Add to Reading List Source URL: montanacha.com Language: English - Date: 2014-06-09 14:11:52 American Quarter Horse Association Complexity classes NP Nuttall
62	A COMPLEX ANALOGUE OF TODA’S THEOREM SAUGATA BASU Abstract. Toda [28] proved in 1989 that the (discrete) polynomial time hierarchy, PH, is contained in the class P#P , namely the class of languages that can be decided Add to Reading List Source URL: www.math.purdue.edu Language: English - Date: 2011-09-22 08:25:51 Applied mathematics Constructible universe Polynomial Time hierarchy theorem Algebraic geometry Real closed field Karp–Lipton theorem Constructible number Mathematics Structural complexity theory Abstract algebra
63	11-722: Grammar Formalisms: Homework 3 Categorial Grammar Due after class 25th April to Alan W Black [removed] Basic Categorial Grammar: Add to Reading List Source URL: www.cs.cmu.edu Language: English - Date: 2006-04-04 14:45:17 Grammar Categorial grammar NP Syntax Combinatory categorial grammar Washington State Judicial elections Linguistics Theoretical computer science Complexity classes
64	On the implementation of AKS-class primality tests R. Crandall* and J. Papadopoulos Add to Reading List Source URL: www.dm.unito.it Language: English - Date: 2005-11-17 04:47:46** Theoretical computer science Finite fields Integer sequences Integer factorization algorithms AKS primality test Lucas–Lehmer primality test Prime number Time complexity Fast Fourier transform Mathematics Primality tests Abstract algebra
65	A Survey of 3sum-Hard Problems James King [removed] Add to Reading List Source URL: www.cs.mcgill.ca Language: English - Date: 2004-12-20 06:07:32 3SUM Computational geometry NP-complete problems Analysis of algorithms Time complexity Reduction Algorithm Boolean satisfiability problem Complexity class Theoretical computer science Applied mathematics Computational complexity theory
66	Visually Localizing Design Problems with Disharmony Maps Richard Wettel∗ and Michele Lanza† REVEAL @ Faculty of Informatics - University of Lugano, Switzerland Add to Reading List Source URL: www.inf.usi.ch Language: English Computer programming Software visualization Object-oriented design Software architecture Class Complexity NDepend Software framework Java Software engineering Computing Object-oriented programming
67	"Shortest Path problem, the Traveling Salesman problem, or the Knapsack problem, are a few of the many combinatorial optimization problems, which have very wide applications in all spheres of our lives. Unfortunately, there is a large class of problems, denoted by class NP, for Add to Reading List Source URL: www.iitk.ac.in Language: English - Date: 2004-12-03 00:57:05 Operations research Linear programming Combinatorial optimization Optimization problem Mathematical optimization Simplex algorithm Computational complexity theory Travelling salesman problem Algorithm Theoretical computer science Mathematics Applied mathematics

UPDATE